Parsing Noisy Recursively-Structured Geometric Patterns
نویسنده
چکیده
This paper describes a method for affine-invariant syntactic pattern recognition of geometric patterns using a new type of context-free graph grammar. The grammar accommodates variability in the geometric relations between parts of patterns; this variability is modelled using affine transformations and metric tensors. A parallel parsing algorithm is outlined, which is suitable for non-Eulerian graphs.
منابع مشابه
A Case Analysis Method Cooperating with ATNG and Its Application to Machine Translation
This paper present a new method for parsing English sentences. The parser called LUTE-EJ parser is combined with case analysis and ATNG-based analysis. LUTE-EJ parser has two interesting mechanical characteristics. One is providing a structured buffer, Structured Constituent Buffer, so as to hold previous fillers for a case structure, instead of case registers before a verb appears in a sentenc...
متن کاملData-Driven Dependency Parsing of New Languages Using Incomplete and Noisy Training Data
We present a simple but very effective approach to identifying high-quality data in noisy data sets for structured problems like parsing, by greedily exploiting partial structures. We analyze our approach in an annotation projection framework for dependency trees, and show how dependency parsers from two different paradigms (graph-based and transition-based) can be trained on the resulting tree...
متن کاملA Local Smoothing and Geodesic Distance Based Clustering Algorithm for High Dimensional Noisy Data; Utilizing Embedded Geometric Structures
A method that utilizes embedded geometric structure is proposed, to enhance clustering. The geometric structure is identified via a combination of a local smoothing method – local linear projection (LLP) – and a computational method for the geodesic distance. It is found that comparing to existing algorithms, it is more efficient to deal with noisy and “structured” data. Simulations for both sy...
متن کاملDiscovering Structured Variations Via Template Matching
Understanding patterns of variation from rawmeasurement data remains a central goal of shape analysis. Such an understanding reveals which elements are repeated, or how elements can be derived as structured variations from a common base element. We investigate this problem in the context of 3D acquisitions of buildings. Utilizing a set of template models, we discover geometric similarities acro...
متن کاملLong Sentence Analysis by Domain-Specific Pattern Grammar
We propose a method for analyzing long complex and compound sentences that utilizes global structure analysis with domain-specific pattern grammar. Previously, long sentence analysis with global information used the following methods: two-level analysis--global structure analysis of long sentences with domain-independent function words and parsing of their constituents[Doi et al., 1991], and pa...
متن کامل